Extending Colorings of Locally
نویسندگان
چکیده
Suppose G is a graph embedded in S g with width (also known as edge width) at least 264(2 g ?1). If P V (G) is such that the distance between any two vertices in P is at least 16, then any 5-coloring of P extends to a 5-coloring of all of G. We present similar extension theorems for 6-and 7-chromatic toroidal graphs, for 3-colorable large-width graphs embedded on S g with every face even sided, and for 4-colorable large-width Eulerian triangulations.
منابع مشابه
Perfect $2$-colorings of the Platonic graphs
In this paper, we enumerate the parameter matrices of all perfect $2$-colorings of the Platonic graphs consisting of the tetrahedral graph, the cubical graph, the octahedral graph, the dodecahedral graph, and the icosahedral graph.
متن کاملMeasurable 3-colorings of Acyclic Graphs
This is the first of two lectures on measurable chromatic numbers given in June 2010 at the University of Barcelona. Our main result here is that acyclic locally finite analytic graphs on Polish spaces admit Baire measurable 3-colorings.
متن کاملExtending Hall's Theorem into List Colorings: A Partial History
In 1988, A. J. W. Hilton and P. D. Johnson Jr. found a natural generalization of the condition in Philip Hall’s celebrated theorem on systems of distinct representatives. This generalization was formed in the relatively new theory of list colorings of graphs. Here we give an account of a strand of development arising from this generalization, concentrating on extensions of Hall’s theorem. New r...
متن کاملSubstitutions and Strongly Deterministic Tilesets
Substitutions generate hierarchical colorings of the plane. Despite the non-locality of substitution rules, one can extend them by adding compatible local matching rules to obtain locally checkable colorings as the set of tilings of finite tileset. We show that the resulting tileset can furthermore be chosen strongly deterministic, a tile being uniquely determined by any two adjacent edges. A t...
متن کامل